Strengthening Alexander’s subbase theorem
نویسندگان
چکیده
منابع مشابه
A strengthening of the Assmus-Mattson theorem
Let w 1 = d, w 2 , ... , w s be the weights of the nonzero codewords in a binary linear [n , k, d] code C, and let w1′ , w2′ , ... , ws ′ ′ be the nonzero weights in the dual code C ⊥ . Let t be an integer in the range 0 < t < d such that there are at most d − t weights wi′ with 0 < wi′ ≤ n − t. Assmus and Mattson proved that the words of any weight w i in C form a t-design. We show that if w 2...
متن کاملStrengthening the Theorem of Embedded Desingularization
Resolution of singularities is one of the central areas of research in Algebraic Geometry. It is a basic prerequisite for the classification of algebraic varieties up to birational equivalence, since it allows to consider only regular varieties. Hironaka’s monumental work [Hi1] gave a non-constructive, existence proof of resolution of singularities over fields of characteristic zero. Constructi...
متن کاملOn weakening the Deduction Theorem and strengthening Modus Ponens
This paper studies, with techniques of Abstract Algebraic Logic, the effects of putting a bound on the cardinality of the set of side formulas in the Deduction Theorem, viewed as a Gentzen-style rule, and of adding additional assumptions inside the formulas present in Modus Ponens, viewed as a Hilbert-style rule. As a result, a denumerable collection of new Gentzen systems and two new sententia...
متن کاملA strengthening of the GL(2) converse theorem
We generalize the method of [Bo03] to prove a version of the converse theorem of JacquetLanglands with relaxed conditions on the twists by ramified idèle class characters.
متن کاملA Strengthening of Brooks' Theorem for Line Graphs
We prove that if G is the line graph of a multigraph, then the chromatic number χ(G) of G is at most max {
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Duke Mathematical Journal
سال: 1968
ISSN: 0012-7094
DOI: 10.1215/s0012-7094-68-03570-9